Search Results/Filters    

Filters

Year

Banks




Expert Group










Full-Text


Issue Info: 
  • Year: 

    2022
  • Volume: 

    52
  • Issue: 

    3
  • Pages: 

    205-215
Measures: 
  • Citations: 

    0
  • Views: 

    136
  • Downloads: 

    23
Abstract: 

Distance-based Clustering methods categorize samples by optimizing a global criterion, finding ellipsoid clusters with roughly equal sizes. In contrast, density-based Clustering techniques form clusters with arbitrary shapes and sizes by optimizing a local criterion. Most of these methods have several hyper-parameters, and their performance is highly dependent on the hyper-parameter setup. Recently, a Gaussian Density Distance (GDD) approach was proposed to optimize local criteria in terms of distance and density properties of samples. GDD can find clusters with different shapes and sizes without any free parameters. However, it may fail to discover the appropriate clusters due to the interfering of clustered samples in estimating the density and distance properties of remaining unclustered samples. Here, we introduce Adaptive GDD (AGDD), which eliminates the inappropriate effect of clustered samples by adaptively updating the parameters during Clustering. It is stable and can identify clusters with various shapes, sizes, and densities without adding extra parameters. The distance metrics calculating the dissimilarity between samples can affect the Clustering performance. The effect of different distance measurements is also analyzed on the method. The experimental results conducted on several well-known datasets show the effectiveness of the proposed AGDD method compared to the other well-known Clustering methods.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 136

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 23 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    1382
  • Volume: 

    9
Measures: 
  • Views: 

    2061
  • Downloads: 

    0
Abstract: 

در این مقاله به بررسی نحوه پیاده سازی الگوریتم chain Code بر روی FPGA می پردازیم. الگوریتم chainCode یکی از الگوریتم های کد کردن تصویر می باشد که برای کد کردن لبه های یک شیء در تصویر استفاده می شود همچنین این الگوریتم می تواند عرض، ارتفاع، محیط و مساحت شیء را نیز به دست آورد. این الگوریتم در پردازش تصویر و شناسایی و مقایسه شیء ها و الگوها با هم کاربرد بسیاری دارد. در این پروژه ابتدا الگوریتم chain Code با استفاده از VHDL که زبان توصیف سخت افزار می باشد، شبیه سازی شده و سپس برنامه نوشته شده به زبان VHDL بر روی مدل Spartan-II از FPGA های شرکت Xilinx پیاده سازی می شود.پردازنده مذکور قابلیت تولید chain Code را برای یک تصویر با ابعاد حداکثر 256*256 پیکسل سیاه و سفید دارا می باشد که البته در صورت نیاز این ابعاد قابل گسترش می باشند. همچنین این پردازنده، طول، عرض، محیط و مساحت شیء موجود در تصویر را نیز علاوه بر تولید کد به دست می آورد.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 2061

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0
Journal: 

خصوصی

Issue Info: 
  • End Date: 

    تیر 1373
Measures: 
  • Citations: 

    0
  • Views: 

    222
  • Downloads: 

    0
Keywords: 
Abstract: 

این طرح بخشی از طرح طراحی و ساخت دستگاه های «Bar. Code. Reader» است که برای استفاده در هتل ها، به عنوان کلید، طراحی شده اند. نمونه مورد نظر، پس از طراحی و ساخت مورد تست قرار گرفت. با توجه به نتایج مثبت آزمایش یک هزار سری از سیستم به سفارش کارفرما ساخته شد و تحویل گردید.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 222

Issue Info: 
  • Year: 

    1388
  • Volume: 

    17
Measures: 
  • Views: 

    303
  • Downloads: 

    0
Abstract: 

لطفا برای مشاهده چکیده به متن کامل (PDF) مراجعه فرمایید.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 303

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0
Author(s): 

اعتضادی حمید

Journal: 

بندر و دریا

Issue Info: 
  • Year: 

    0
  • Volume: 

    27
  • Issue: 

    192
  • Pages: 

    0-0
Measures: 
  • Citations: 

    0
  • Views: 

    907
  • Downloads: 

    0
Keywords: 
Abstract: 

لطفا برای مشاهده متن کامل این مقاله اینجا را کلیک کنید.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 907

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2022
  • Volume: 

    52
  • Issue: 

    4
  • Pages: 

    281-291
Measures: 
  • Citations: 

    0
  • Views: 

    155
  • Downloads: 

    18
Abstract: 

Automatic topic detection seems unavoidable in social media analysis due to big text data which their users generate. Clustering-based methods are one of the most important and up-to-date categories in topic detection. The goal of this research is to have a wide study on this category. Therefore, this paper aims to study the main components of Clustering-based-topic-detection, which are embedding methods, distance metrics, and Clustering algorithms. Transfer learning and consequently pretrained language models and word embeddings have been considered in recent years. Regarding the importance of embedding methods, the efficiency of five new embedding methods, from earlier to recent ones, are compared in this paper. To conduct our study, two commonly used distance metrics, in addition to five important Clustering algorithms in the field of topic detection, are implemented by the authors. As COVID-19 has turned into a hot trending topic on social networks in recent years, a dataset including one-month tweets collected with COVID-19-related hashtags is used for this study. More than 7500 experiments are performed to determine tunable parameters. Then all combinations of embedding methods, distance metrics and Clustering algorithms (50 combinations) are evaluated using Silhouette metric. Results show that T5 strongly outperforms other embedding methods, cosine distance is weakly better than other distance metrics, and DBSCAN is superior to other Clustering algorithms.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 155

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 18 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2022
  • Volume: 

    7
  • Issue: 

    2
  • Pages: 

    1-22
Measures: 
  • Citations: 

    0
  • Views: 

    158
  • Downloads: 

    15
Abstract: 

Purpose: Clustering and co-word analysis is a method to reveal relationships and links and illustrate the intellectual structure of a scientific field. This research tries to study the intellectual structure of articles in the field of futures studies in Iran by using the technique of co-word analysis. Method: The current research is a descriptive-analytical development with a scientometric approach. The statistical population is 921 articles retrieved records in the field of futures studies. Findings: The findings showed that articles in the field of futures studies in Iran are often associated with positive growth, and in terms of frequency, the keywords scenario, Islamic Republic, and foresight are the most frequent in futures studies. The findings related to the hierarchical Clustering led to the formation of 8 clusters in this field, namely "ICT visions", "geographers who love the future", "knowledge development", " Futuristic higher education", "Future of Religion", "Regional Relations", "Strategic Foresight" and "Heavy Weight of Method". Conclusion: According to the findings of the current research and the high frequency of the keyword scenario, as well as the density and relationships of this keyword with other keywords, it can be concluded that the scenario is the dominant approach in futures studies. Also, according to the resulting clusters, it was observed that these researches have a high variety, but addressing the future in many areas is still neglected.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 158

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 15 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Writer: 

Hashempour Sadeghian Armindokht | NEZAMABADI POUR HOSSEIN

Issue Info: 
  • Year: 

    2015
  • Volume: 

    1
Measures: 
  • Views: 

    167
  • Downloads: 

    72
Abstract: 

TEXT MINING IS A FIELD THAT IS CONSIDERED AS AN EXTENSION OF DATA MINING IN GENERAL, ALSO KNOWN AS KNOWLEDGE DISCOVERY IN DATABASES. IN THE CONTEXT OF TEXT MINING, DOCUMENT Clustering IS AN UNSUPERVISED LEARNING METHOD FOR AUTOMATICALLY SEGREGATING SIMILAR DOCUMENTS OF A CORPUS INTO THE SAME GROUP, CALLED CLUSTER, AND DISSIMILAR DOCUMENTS TO DIFFERENT GROUPS. WHILE HUNDREDS OF Clustering ALGORITHMS EXIST, IT IS DIFFICULT TO FIND A SINGLE Clustering ALGORITHM THAT CAN HANDLE ALL TYPES OF CLUSTER SHAPES AND SIZES, OR EVEN DECIDE WHICH ALGORITHM WOULD BE THE BEST ONE FOR A PARTICULAR DATA SET. EACH ALGORITHM HAS ITS OWN APPROACH FOR ESTIMATING THE NUMBER OF CLUSTERS, IMPOSING A STRUCTURE ON THE DATA, AND VALIDATING THE RESULTING CLUSTERS. THE IDEA OF COMBINING DIFFERENT Clustering EMERGED AS AN APPROACH TO OVERCOME THE WEAKNESS OF SINGLE ALGORITHMS AND FURTHER IMPROVE THEIR PERFORMANCES. ON THE OTHER HAND, INSPIRED BY THE GRAVITATIONAL LAW, DIFFERENT Clustering ALGORITHMS HAVE BEEN INTRODUCED THAT EACH ONE ATTEMPTED TO CLUSTER COMPLEX DATASETS. GRAVITATIONAL ENSEMBLE Clustering (GEC) IS AN ENSEMBLE METHOD THAT EMPLOYS BOTH THE CONCEPTS OF GRAVITATIONAL Clustering AND ENSEMBLE Clustering TO REACH A BETTER Clustering RESULT. THIS PAPER REPRESENTS AN APPLICATION OF GEC TO THE PROBLEM OF DOCUMENT Clustering. THE PROPOSED METHOD USES A MODIFICATION OF THE ORIGINAL GEC ALGORITHM. THIS MODIFICATION TRIES TO PRODUCE A MORE VARIED Clustering ENSEMBLE USING NEW PARAMETER SETTING. COMPUTATIONAL EXPERIMENTS WERE CONDUCTED TO TEST THE PERFORMANCE OF THE GEC APPROACH USING DOCUMENT DATASETS. PROMISING RESULTS OF THE PRESENTED METHOD WERE OBTAINED IN COMPARISON WITH COMPETING ALGORITHMS. ...

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 167

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 72
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button